On the polynomial-space completeness of intuitionistic propositional logic
نویسنده
چکیده
We present an alternative, purely semantical and relatively simple, proof of the Statman’s result that both intuitionistic propositional logic and its implicational fragment are PSPACE -complete.
منابع مشابه
On Sequent Calculi for Intuitionistic Propositional Logic
The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملProof-Search in Intuitionistic Logic Based on Constraint Satisfaction
We characterize provability in intuitionistic predicate logic in terms of derivation skeletons and constraints and study the problem of instantiations of a skeleton to valid derivations. We prove that for two diierent notions of a skeleton the problem is respectively polynomial and NP-complete. As an application of our technique, we demonstrate PSPACE-completeness of the prenex fragment of intu...
متن کاملIntuitionistic Propositional Logic is Polynomial-Space Complete
Abatraet. It is the purpose of this note to show that the question of whether a given propositional formula is intuitionistically valid (in Brouwer’s sense, in Kripke’s sense, or just provable by Heyting’s rules, see Kreisel[7]) is p-space complete (see Stockmeyer [14]). Our result has the following consequences: (a) There is a simple (i.e. polynomial time) translation of intuitionistic proposi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 42 شماره
صفحات -
تاریخ انتشار 2003